An efficient encoding algorithm for (n, k) binary cyclic codes
نویسندگان
چکیده
منابع مشابه
Efficient encoding for a family of quasi-cyclic LDPC codes
In general, encoding for LDPC codes can be difficult to realize efficiently. This paper presents techniques and architectures for LDPC encoding that are efficient and practical for a particular class of codes. These codes are the irregular partitioned permutation LDPC codes recently introduced by the author at ICC’03, [4]. Since these codes are quasi-cyclic, it is known that a simpler encoding ...
متن کاملEfficient Encoding Algorithm for Third-Order Spectral-Null Codes
An efficient algorithm is presented for encoding unconstrained information sequences into a third-order spectral-null code of length n and redundancy 9 log 2 n + O(log logn). The encoding can be implemented using O(n) integer additions and O(n logn) counter increments.
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملAn Efficient Encoding-Decoding of Large Girth LDPC Codes Based on Quasi-Cyclic
In this paper, we propose a novel method for constructing quasi-cyclic low-density parity check (QC-LDPC) codes based row division method which can guarantee a concentrated node degree distribution with large girth. The main advantage is that large girth QC-LDPC codes can be easily constructed with a variety of block lengths and rates. Simulation results show that the proposed codes perform sig...
متن کاملAn efficient centralized binary multicast network coding algorithm for any cyclic network
We give an algorithm for finding network encoding and decoding equations for errorfree multicasting networks with multiple sources and sinks. The algorithm given is efficient (polynomial complexity) and works on any kind of network (acyclic, link cyclic, flow cyclic, or even in the presence of knots). The key idea will be the appropriate use of the delay (both natural and additional) during the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2012
ISSN: 0974-6846,0974-5645
DOI: 10.17485/ijst/2012/v5i5.6